Kneser Representations of Graphs
نویسندگان
چکیده
The Kneser graph Kn:k for positive integers n ≥ k has as its vertex set the k-element subsets of some n-set, with disjoint sets being adjacent. Every finite simple graph can be found as an induced subgraph of some Kneser graph; this can be viewed as a way of representing graphs by labelling their vertices with sets. We explore questions of finding the smallest representation (both in terms of n, the size of the label set, and k, the size of the labels) of certain classes of graphs and draw connections to related problems.
منابع مشابه
Bipartite Kneser Graphs are Hamiltonian
The Kneser graph K(n, k) has as vertices all k-element subsets of [n] := {1, 2, . . . , n} and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph H(n, k) has as vertices all k-element and (n−k)-element subsets of [n] and an edge between any two vertices where one is a subset of the other. It has long been conjectured that all connected Kneser graphs and bipar...
متن کاملShifts of the stable Kneser graphs and hom-idempotence
A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n, k) are not weakly hom-idempotent for n ≥ 2k + 1, k ≥ 2. For s ≥ 2, we characterize all the shifts (i.e., automorphisms of the graph that map every vertex to one of its neighbors) ...
متن کاملSymmetries of the Stable Kneser Graphs
It is well known that the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters. For n ≥ 2k + 1, k ≥ 2, we prove that the automorphism group of the stable Kneser graph SGn,k is the dihedral group of order 2n. Let [n] := [1, 2, 3, . . . , n]. For each n ≥ 2k, n, k ∈ {1, 2, 3, . . .}, the Kneser graph KGn,k has as vertices the k-subsets of [n] with edges defined by disj...
متن کاملRandom Kneser graphs and hypergraphs
A Kneser graph KGn,k is a graph whose vertices are all k-element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lovász states that the chromatic number of a Kneser graph KGn,k is equal to n − 2k + 2. In this paper we discuss the chromatic number of random Kneser graphs and hypergraphs. It was studied in two recent paper...
متن کاملResolving sets for Johnson and Kneser graphs
A set of vertices S in a graph G is a resolving set for G if, for any two vertices u,v, there exists x ∈ S such that the distances d(u,x) 6= d(v,x). In this paper, we consider the Johnson graphs J(n,k) and Kneser graphs K(n,k), and obtain various constructions of resolving sets for these graphs. As well as general constructions, we show that various interesting combinatorial objects can be used...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 23 شماره
صفحات -
تاریخ انتشار 2009